Anti-van der Waerden Numbers of 3-Term Arithmetic Progression
نویسندگان
چکیده
منابع مشابه
Anti-van der Waerden Numbers of 3-Term Arithmetic Progression
The anti-van der Waerden number, denoted by aw([n], k), is the smallest r such that every exact r-coloring of [n] contains a rainbow k-term arithmetic progression. Butler et al. showed that dlog3 ne + 2 6 aw([n], 3) 6 dlog2 ne + 1, and conjectured that there exists a constant C such that aw([n], 3) 6 dlog3 ne + C. In this paper, we show this conjecture is true by determining aw([n], 3) for all ...
متن کاملArithmetic Progressions in Sumsets and Van der Waerden Numbers
We introduce the concepts of hereditary non-uniformity and restricted hereditary nonuniformity for subsets of Z/NZ, and prove theorems about such sets which imply various results about arithmetic progressions. In particular we show that if A is a subset of Z/NZ with size αN , where α ∈ (0, 1) is fixed, then A + A contains an arithmetic progression of length at least ec √ logN . This improves a ...
متن کاملBounds on some van der Waerden numbers
For positive integers s and k1,k2, . . . ,ks, the van der Waerden number w(k1,k2, . . . ,ks;s) is the minimum integer n such that for every s-coloring of set {1,2, . . . ,n}, with colors 1,2, . . . ,s, there is a ki-term arithmetic progression of color i for some i. We give an asymptotic lower bound for w(k,m;2) for fixed m. We include a table of values of w(k,3;2) that are very close to this l...
متن کاملSatisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive integer functions, without actually providing their closed algebraic form or tight lower and upper bounds. The area of Ramsey theory is especially rich in such results. Using the problem of computing van der Waerden n...
متن کاملSome New Exact van der Waerden numbers
For positive integers r, k0, k1, ..., kr−1, the van der Waerden number w(k0, k1, ..., kr−1) is the least positive integer n such that whenever {1, 2, . . . , n} is partitioned into r sets S0, S1, ..., Sr−1, there is some i so that Si contains a ki-term arithmetic progression. We find several new exact values of w(k0, k1, ..., kr−1). In addition, for the situation in which only one value of ki d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6101